Orders on Subsets Rationalised by Abstract Convex Geometries

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Orders on Subsets Rationalised by Abstract Convex Geometries

We find conditions on the order on subsets of a finite set which are necessary and sufficient for the relative ranking of any two subsets in this order to be determined by their extreme elements relative to an abstract convex geometry. It turns out that this question is closely related to the rationalisability of path independent choice functions by hyper-relations.

متن کامل

Realization of abstract convex geometries by point configurations

The following classical example of convex geometries shows how they earned their name. Given a set of points X in Euclidean space R, one defines a closure operator on X as follows: for any Y ⊆ X, Y = convex hull(Y ) ∩ X. One easily verifies that such an operator satisfies the anti-exchange axiom. Thus, (X,−) is a convex geometry. Denote by Co(R, X) the closure lattice of this closure space, nam...

متن کامل

Choice functions and abstract convex geometries *

A main aim of this paper is to make connections between two well – but up to now independently – developed theories, the theory of choice functions and the theory of closure operators. It is shown that the classes of ordinally rationalizable and path independent choice functions are related to the classes of distributive and anti-exchange closures.  1999 Elsevier Science B.V. All rights reserved.

متن کامل

Dual greedy polyhedra, choice functions, and abstract convex geometries

We consider a system of linear inequalities and its associated polyhedron for which we can maximize any linear objective function by /nding tight inequalities at an optimal solution in a greedy way. We call such a system of inequalities a dual greedy system and its associated polyhedron a dual greedy polyhedron. Such dual greedy systems have been considered by Faigle and Kern, and Kr1 uger for ...

متن کامل

The affine representation theorem for abstract convex geometries

243 57698;:=< >;: 57? :=@BADCFEHGJIF3=57?LK EM6 I0@N57ANEHI0OPI0K GB@BAQI 3=@R?S59T :=O EU6V@BAD5VT W 3 :XTYKZC\[]T :=OU? I 6$I 6 T ^ I ?_EHGB5;6

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Order

سال: 2009

ISSN: 0167-8094,1572-9273

DOI: 10.1007/s11083-009-9121-0